摘要 :
Input-output properties are studied for a linear network model with homogeneous single-input single-output subsystems. Specifically, the finite- and infinite- zero structure of a channel in the network, defined by a single externa...
展开
Input-output properties are studied for a linear network model with homogeneous single-input single-output subsystems. Specifically, the finite- and infinite- zero structure of a channel in the network, defined by a single external actuation and measurement, is characterized. This is done by developing a two-layer transformation for the input-output model, which expresses the zero structure in terms of the subsystem model, global network interactions (graph), and the input and output locations. This algebraic characterization then provides a means to: (1) distinguish structural properties of the input-output channel (minimum and nonminimum behavior) in terms of the network's graph, and (2) design of the graph to shape the input-output dynamics. Similar characterizations are also briefly explored for a multiple-input multiple-output (MIMO) network model with collocated measurements and actuations.
收起
摘要 :
In this paper, we provide a novel methodology to co-design controller, scheduling and routing in a wireless control network compliant with the WirelessHART protocol. We both provide a modeling framework and derive a novel suboptim...
展开
In this paper, we provide a novel methodology to co-design controller, scheduling and routing in a wireless control network compliant with the WirelessHART protocol. We both provide a modeling framework and derive a novel suboptimal solution to the linear-quadratic regulator problem for a class of systems that extends Markov jump linear system considering both continuous and discrete inputs. To allow that, our results can be directly implemented in a real WirelessHART network, we setup a receding horizon optimization problem that takes into account the constraint for compliance with WirelessHART and validate our solution on a batch reactor control loop.
收起
摘要 :
In this technical note we provide a set of stability conditions for linear time-invariant networked control systems with arbitrary topology, using a Lyapunov direct approach. We then use these stability conditions to provide a nov...
展开
In this technical note we provide a set of stability conditions for linear time-invariant networked control systems with arbitrary topology, using a Lyapunov direct approach. We then use these stability conditions to provide a novel low-complexity algorithm for the design of a sparse observer-based control network. We employ distributed observers by employing the output of other nodes to improve the stability of each observer dynamics. To avoid unbounded growth of controller and observer gains, we impose bounds on their norms. The effects of relaxation of these bounds is discussed when trying to find the complete decentralization conditions.
收起
摘要 :
The network control system has low cost, resource sharing, remote operation and control,it also has high diagnostic capabilities and is easy to install and maintain. This can effectively reduce the weight and volume of the system,...
展开
The network control system has low cost, resource sharing, remote operation and control,it also has high diagnostic capabilities and is easy to install and maintain. This can effectively reduce the weight and volume of the system, and increase the flexibility and reliability of the system. Therefore, it is widely used in equipment manufacturing, industrial automation, aerospace and medical care. However, the introduction of the network has brought a lot of new uncertainties, such as packet loss, delay, etc., which pose new challenges to the classic control problem. Therefore, this study combines the robust control theory to reasonably model the network control system. By introducing various performance indicators, the robustness and stability of the system are studied in coordination, and the internal relationship between performance indicators and network factors is established. This study also focuses on reducing the conservativeness of the results, and proposes new stability conditions and controller design methods for networked control systems. By using an improved time-delay system analysis method to derive the sufficient conditions for the existence of robust guaranteed-performance controllers, the parameters of the sub-optimal performance controller parameters are solved by the algorithm.
收起
摘要 :
This paper addresses a design method of controller networks, i.e., networked controllers which cooperatively determine the control inputs by exchanging the information with their neighbors. The problem considered here is to design...
展开
This paper addresses a design method of controller networks, i.e., networked controllers which cooperatively determine the control inputs by exchanging the information with their neighbors. The problem considered here is to design the controllers stabilizing the resulting feedback system for an unknown network topology. As a solution to the problem, we propose controllers such that the entire network acts as a state feedback controller through a consensus protocol, and derive gain conditions to stabilize the resulting feedback system. This enables us to obtain a controller network that is robust against uncertainties of the network topology. (C) 2016 The Author(s). Published by Elsevier B.V.
收起
摘要 :
In this paper, we address the optimal control problem for Boolean control networks (BCNs). We first consider the problem of finding the input sequences that minimize a given cost function over a finite time horizon. The problem so...
展开
In this paper, we address the optimal control problem for Boolean control networks (BCNs). We first consider the problem of finding the input sequences that minimize a given cost function over a finite time horizon. The problem solution is obtained by means of a recursive algorithm that represents the analogue for BCNs of the difference Riccati equation for linear systems. We prove that a significant number of optimal control problems for BCNs can be easily reframed into the present setup. In particular, the cost function can be adjusted so as to include penalties on the switchings, provided that we augment the size of the BCN state variable. In the second part of the paper, we address the infinite horizon optimal control problem and we provide necessary and sufficient conditions for the problem solvability. The solution is obtained as the limit of the solution over the finite horizon $[0,T]$, and it is always achieved in a finite number of steps. Finally, the average cost problem over the infinite horizon, investigated in “Optimal control of logical control networks” (Y. Zhao , IEEE Trans. Autom. Control, vol 56, no. 8, pp. 1766–1776, Aug. 2011), is addressed by making use of the results obtained in the previous sections.
收起
摘要 :
In this paper, different traffic light control structures over communication links, including the decentralised, quasi-decentralised, distributed and hierarchical networked structures, are considered. These structures used for coo...
展开
In this paper, different traffic light control structures over communication links, including the decentralised, quasi-decentralised, distributed and hierarchical networked structures, are considered. These structures used for coordinating multiple intersections, which could be a great application of networked control problem control for the signalised traffic light intersections that will help the designer to achieve certain objectives. Some of these objectives are, minimise the waiting time during the red light period and perform better control in the next green cycle, maximise the flow between consecutive intersections which will minimise the number of stops, minimise the average waiting time and more will be highlighted in this paper. A quick literature about all models used for traffic control problem is done. A generic state space model of traffic dynamics under these different control structures is proposed that takes into account many effects of lossy communication links such as networked induced delays, packet dropout and varying sample interval. Also, a sufficient condition for system stability is provided based on LMI. Finally, comparison of different types of networked control systems was done using MATLAB simulation.
收起
摘要 :
In this paper, we consider the controllability problem for multi-agent networked control systems. The main results of the paper are new graph-theoretic necessary conditions for controllability involving almost equitable graph vert...
展开
In this paper, we consider the controllability problem for multi-agent networked control systems. The main results of the paper are new graph-theoretic necessary conditions for controllability involving almost equitable graph vertex partitions. We generalize the known results on the role of graph symmetries and uncontrollability to weighted digraphs with multiple-leaders and we also consider the broadcasted control scenario. Our results show that the internal structure of communities in a graph can induce obstructions to controllability that cannot be characterized by symmetry arguments alone and that in some cases depend on the number-theoretic properties of the communities. We show via examples that our results can be used to account for a large portion of uncontrollable inducing leader-selections that could not have otherwise been accounted for using symmetry results. (C) 2017 Elsevier Ltd. All rights reserved.
收起
摘要 :
This paper considers the infinite horizon optimal control of logical control networks, including Boolean control networks as a special case. Using the framework of game theory, the optimal control problem is formulated. In the sig...
展开
This paper considers the infinite horizon optimal control of logical control networks, including Boolean control networks as a special case. Using the framework of game theory, the optimal control problem is formulated. In the sight of the algebraic form of a logical control network, its cycles can be calculated algebraically. Then the optimal control is revealed over a certain cycle. When the games, using memory $mu>1$ (which means the players only consider previous $mu$ steps' action at each step), are considered, the higher order logical control network is introduced and its algebraic form is also presented, which corresponds to a conventional logical control network (i.e., $mu=1$ ). Then it is proved that the optimization technique developed for conventional logical control networks is also applicable to this $mu$-memory case.
收起
摘要 :
This paper investigates how to make decentralised networks, amenable to external control, i.e., how to ensure that they are appropriately organised so that they can be effectively 'reprogrammed'. In particular, we study networked ...
展开
This paper investigates how to make decentralised networks, amenable to external control, i.e., how to ensure that they are appropriately organised so that they can be effectively 'reprogrammed'. In particular, we study networked systems whose interaction dynamics are given by a nearest-neighbour averaging rule, with one leader node providing the control input to the entire system. The main result is a necessary and sufficient condition for the controllability of such systems in terms of the graph topology. In particular, we give a graph theoretic interpretation of the controllability properties through the so-called relaxed equitable partition.
收起
原文获取